Computación Evolutiva para Resolución de CSPs

Scheduling problems are a paradigm of CSP. In this paper we present a number of techniques to solve them by means of Genetic Algorithms. Firstly we consider conventional Genetic Algorithms and then we demonstrate that their performance really improves when used together with other techniques such as dispatching rules, probability based heuristics or local search. We report results from an experimental study showing that a local search method is able to improve the performance of a Genetic Algorithm in solving the Job Shop Scheduling problem.